Unstructured Peer-to-Peer Networks: Topological Properties and Search Performance
Identifieur interne : 001109 ( Main/Exploration ); précédent : 001108; suivant : 001110Unstructured Peer-to-Peer Networks: Topological Properties and Search Performance
Auteurs : L. Fletcher [États-Unis] ; A. Sheth [États-Unis] ; Katy Börner [États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2005.
Abstract
Abstract: Performing efficient decentralized search is a fundamental problem in Peer-to-Peer (P2P) systems. There has been a significant amount of research recently on developing robust self-organizing P2P topologies that support efficient search. In this paper we discuss four structured and unstructured P2P models (CAN, Chord, PRU, and Hypergrid) and three characteristic search algorithms (BFS, k-Random Walk, and GAPS) for unstructured networks. We report on the results of simulations of these networks and provide measurements of search performance, focusing on search in unstructured networks. We find that the proposed models produce small-world networks, and yet none exhibit power-law degree distributions. Our simulations also suggest that random graphs support decentralized search more effectively than the proposed unstructured P2P models. We also find that on these topologies, the basic breadth-first search algorithm and its simple variants have the lowest search cost.
Url:
DOI: 10.1007/11574781_2
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000578
- to stream Istex, to step Curation: 000578
- to stream Istex, to step Checkpoint: 000748
- to stream Main, to step Merge: 001126
- to stream Main, to step Curation: 001109
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct:series"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Unstructured Peer-to-Peer Networks: Topological Properties and Search Performance</title><author><name sortKey="Fletcher, L" sort="Fletcher, L" uniqKey="Fletcher L" first="L." last="Fletcher">L. Fletcher</name></author><author><name sortKey="Sheth, A" sort="Sheth, A" uniqKey="Sheth A" first="A." last="Sheth">A. Sheth</name></author><author><name sortKey="Borner, Katy" sort="Borner, Katy" uniqKey="Borner K" first="Katy" last="Börner">Katy Börner</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:9662A0EB15066CA1C9647127542C380ABE4D65BF</idno><date when="2005" year="2005">2005</date><idno type="doi">10.1007/11574781_2</idno><idno type="url">https://api.istex.fr/document/9662A0EB15066CA1C9647127542C380ABE4D65BF/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000578</idno><idno type="wicri:Area/Istex/Curation">000578</idno><idno type="wicri:Area/Istex/Checkpoint">000748</idno><idno type="wicri:doubleKey">0302-9743:2005:Fletcher L:unstructured:peer:to</idno><idno type="wicri:Area/Main/Merge">001126</idno><idno type="wicri:Area/Main/Curation">001109</idno><idno type="wicri:Area/Main/Exploration">001109</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Unstructured Peer-to-Peer Networks: Topological Properties and Search Performance</title><author><name sortKey="Fletcher, L" sort="Fletcher, L" uniqKey="Fletcher L" first="L." last="Fletcher">L. Fletcher</name><affiliation wicri:level="1"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Computer Science Department, Indiana University, Bloomington</wicri:regionArea><wicri:noRegion>Bloomington</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author><author><name sortKey="Sheth, A" sort="Sheth, A" uniqKey="Sheth A" first="A." last="Sheth">A. Sheth</name><affiliation wicri:level="1"><country xml:lang="fr">États-Unis</country><wicri:regionArea>School of Informatics, Indiana University, Bloomington</wicri:regionArea><wicri:noRegion>Bloomington</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author><author><name sortKey="Borner, Katy" sort="Borner, Katy" uniqKey="Borner K" first="Katy" last="Börner">Katy Börner</name><affiliation wicri:level="1"><country xml:lang="fr">États-Unis</country><wicri:regionArea>School of Library and Information Science, Indiana University, Bloomington</wicri:regionArea><wicri:noRegion>Bloomington</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2005</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">9662A0EB15066CA1C9647127542C380ABE4D65BF</idno><idno type="DOI">10.1007/11574781_2</idno><idno type="ChapterID">2</idno><idno type="ChapterID">Chap2</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Performing efficient decentralized search is a fundamental problem in Peer-to-Peer (P2P) systems. There has been a significant amount of research recently on developing robust self-organizing P2P topologies that support efficient search. In this paper we discuss four structured and unstructured P2P models (CAN, Chord, PRU, and Hypergrid) and three characteristic search algorithms (BFS, k-Random Walk, and GAPS) for unstructured networks. We report on the results of simulations of these networks and provide measurements of search performance, focusing on search in unstructured networks. We find that the proposed models produce small-world networks, and yet none exhibit power-law degree distributions. Our simulations also suggest that random graphs support decentralized search more effectively than the proposed unstructured P2P models. We also find that on these topologies, the basic breadth-first search algorithm and its simple variants have the lowest search cost.</div></front></TEI><affiliations><list><country><li>États-Unis</li></country></list><tree><country name="États-Unis"><noRegion><name sortKey="Fletcher, L" sort="Fletcher, L" uniqKey="Fletcher L" first="L." last="Fletcher">L. Fletcher</name></noRegion><name sortKey="Borner, Katy" sort="Borner, Katy" uniqKey="Borner K" first="Katy" last="Börner">Katy Börner</name><name sortKey="Borner, Katy" sort="Borner, Katy" uniqKey="Borner K" first="Katy" last="Börner">Katy Börner</name><name sortKey="Fletcher, L" sort="Fletcher, L" uniqKey="Fletcher L" first="L." last="Fletcher">L. Fletcher</name><name sortKey="Sheth, A" sort="Sheth, A" uniqKey="Sheth A" first="A." last="Sheth">A. Sheth</name><name sortKey="Sheth, A" sort="Sheth, A" uniqKey="Sheth A" first="A." last="Sheth">A. Sheth</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/CyberinfraV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001109 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001109 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= CyberinfraV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:9662A0EB15066CA1C9647127542C380ABE4D65BF
|texte= Unstructured Peer-to-Peer Networks: Topological Properties and Search Performance
}}
| This area was generated with Dilib version V0.6.25. |  |